Fractional Extreme Value Adaptive Training Method: Fractional Steepest Descent Approach
نویسندگان
چکیده
منابع مشابه
Soliton approach to the noisy Burgers equation Steepest descent method
The noisy Burgers equation in one spatial dimension is analyzed by means of the Martin-SiggiaRose technique in functional form. In a canonical formulation the morphology and scaling behavior are accessed by mean of a principle of least action in the asymptotic non-perturbative weak noise limit. The ensuing coupled saddle point field equations for the local slope and noise fields, replacing the ...
متن کاملExtreme-value statistics of fractional Brownian motion bridges.
Fractional Brownian motion is a self-affine, non-Markovian, and translationally invariant generalization of Brownian motion, depending on the Hurst exponent H. Here we investigate fractional Brownian motion where both the starting and the end point are zero, commonly referred to as bridge processes. Observables are the time t_{+} the process is positive, the maximum m it achieves, and the time ...
متن کاملOn the Steepest Descent Method for Matrix
We consider the special case of the restarted Arnoldi method for approximating the product of a function of a Hermitian matrix with a vector which results when the restart length is set to one. When applied to the solution of a linear system of equations, this approach coincides with the method of steepest descent. We show that the method is equivalent with an interpolation process in which the...
متن کاملA limited memory steepest descent method
The possibilities inherent in steepest descent methods have been considerably amplified by the introduction of the Barzilai-Borwein choice of step-size, and other related ideas. These methods have proved to be competitive with conjugate gradient methods for the minimization of large dimension unconstrained minimization problems. This paper suggests a method which is able to take advantage of th...
متن کاملOn the Steepest Descent Method for Matrix
We consider the special case of the restarted Arnoldi method for approximating the product of a function of a Hermitian matrix with a vector which results when the restart length is set to one. When applied to the solution of a linear system of equations, this approach coincides with the method of steepest descent. We show that the method is equivalent with an interpolation process in which the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Neural Networks and Learning Systems
سال: 2015
ISSN: 2162-237X,2162-2388
DOI: 10.1109/tnnls.2013.2286175